More on Sombor Index of Graphs
نویسندگان
چکیده
Recently, a novel degree-based molecular structure descriptor, called Sombor index was introduced. Let G=(V(G),E(G)) be graph. Then, the of G is defined as SO(G)=?uv?E(G)dG2(u)+dG2(v). In this paper, we give some lemmas that can used to compare indices between two graphs. With these lemmas, determine graph with maximum SO among all cacti n vertices and k cut edges. Furthermore, unique p pendant characterized. addition, find extremal graphs respect quasi-unicyclic
منابع مشابه
MORE ON EDGE HYPER WIENER INDEX OF GRAPHS
Let G=(V(G),E(G)) be a simple connected graph with vertex set V(G) and edge set E(G). The (first) edge-hyper Wiener index of the graph G is defined as: $$WW_{e}(G)=sum_{{f,g}subseteq E(G)}(d_{e}(f,g|G)+d_{e}^{2}(f,g|G))=frac{1}{2}sum_{fin E(G)}(d_{e}(f|G)+d^{2}_{e}(f|G)),$$ where de(f,g|G) denotes the distance between the edges f=xy and g=uv in E(G) and de(f|G)=∑g€(G)de(f,g|G). In thi...
متن کاملmore on edge hyper wiener index of graphs
let $g=(v(g),e(g))$ be a simple connected graph with vertex set $v(g)$ and edge set $e(g)$. the (first) edge-hyper wiener index of the graph $g$ is defined as: $$ww_{e}(g)=sum_{{f,g}subseteq e(g)}(d_{e}(f,g|g)+d_{e}^{2}(f,g|g))=frac{1}{2}sum_{fin e(g)}(d_{e}(f|g)+d^{2}_{e}(f|g)),$$ where $d_{e}(f,g|g)$ denotes the distance between the edges $f=xy$ and $g=uv$ in $e(g)$ and $d_{e}(f|g)=s...
متن کاملComputing Szeged index of graphs on triples
ABSTRACT Let G=(V,E) be a simple connected graph with vertex set V and edge set E. The Szeged index of G is defined by where respectively is the number of vertices of G closer to u (respectively v) than v (respectively u). If S is a set of size let V be the set of all subsets of S of size 3. Then we define t...
متن کاملOn the harmonic index of bicyclic graphs
The harmonic index of a graph $G$, denoted by $H(G)$, is defined asthe sum of weights $2/[d(u)+d(v)]$ over all edges $uv$ of $G$, where$d(u)$ denotes the degree of a vertex $u$. Hu and Zhou [Y. Hu and X. Zhou, WSEAS Trans. Math. {bf 12} (2013) 716--726] proved that for any bicyclic graph $G$ of order $ngeq 4$, $H(G)le frac{n}{2}-frac{1}{15}$ and characterize all extremal bicyclic graphs.In this...
متن کاملOn Third Geometric-Arithmetic Index of Graphs
Continuing the work K. C. Das, I. Gutman, B. Furtula, On second geometric-arithmetic index of graphs, Iran. J. Math Chem., 1(2) (2010) 17-28, in this paper we present lower and upper bounds on the third geometric-arithmetic index GA3 and characterize the extremal graphs. Moreover, we give Nordhaus-Gaddum-type result for GA3.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2022
ISSN: ['2227-7390']
DOI: https://doi.org/10.3390/math10030301